Binary Gray Codes with Long Bit Runs
نویسندگان
چکیده
منابع مشابه
Binary Gray Codes with Long Bit Runs
We show that there exists an n-bit cyclic binary Gray code all of whose bit runs have length at least n − 3 log2 n. That is, there exists a cyclic ordering of {0, 1}n such that adjacent words differ in exactly one (coordinate) bit, and such that no bit changes its value twice in any subsequence of n − 3 log2 n consecutive words. Such Gray codes are ‘locally distance preserving’ in that Hamming ...
متن کاملEquivalence classes of 5-bit Gray codes
An n-bit gray code can be represented as a hamilton cycle in the n-cube together with a direction. Two n-bit gray codes are equivalent if there is an automorphism of the n-cube that maps the edge set of one onto the other. In this paper we detail a method for counting the number of equivalence classes of 5-bit gray codes, and classify the equivalence classes according to the distribution of the...
متن کاملOn binary reflected Gray codes and functions
The Binary Reflected Gray Code function b is defined as follows: If m is a nonnegative integer, then b(m) is the integer obtained when initial zeros are omitted from the binary reflected Gray code of length m. This paper examines this Gray code function and its inverse and gives simple algorithms to generate both. It also simplifies Conder’s result that the jth letter of the kth word of the bin...
متن کاملLow Bit Rate Coding with Binary Golay Codes
Even if the computational power is constantly increasing, as well as the storage resources, the type and quantity of data stored and exchanged over the communication channels is expanding. Multimedia communication becomes an everyday aspect of our lives, and with it our expectations relative to the quality of both the communication and content are raising. From the content coding point of view,...
متن کاملExplicit definition of the binary reflected Gray codes
It is shown that for 1 j n and 1 k 2; the jth letter of the kth word of the binary re ected Gray code of length n is equal to the parity of the binomial coe cient 2 n 2 j C[2n 2 j 1 k=2] modulo 2. Also it is shown how this observation and the usual iterative de nition of the binary re ected Gray codes are revealed in a modi ed version of Sierpinski's gasket (Pascal's triangle modulo 2).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2003
ISSN: 1077-8926
DOI: 10.37236/1720